package com.zhangxiaofanfan.hotcode.third;


/**
 * <a href="https://leetcode.cn/problems/search-in-rotated-sorted-array/description/?envType=study-plan-v2&envId=top-100-liked">33. 搜索旋转排序数组</a>
 *
 * @date 2024-06-29 03:21:25
 * @author zhangxiaofanfan
 */
public class HotCode066 {
    public static void main(String[] args) {
        HotCode066 hotCode = new HotCode066();
        int[] nums = {3, 1};
        System.out.println(hotCode.search(nums, 1));
    }

    public int search(int[] nums, int target) {
        return 0;
    }

}
